Extrinsic Bayesian Optimization on Manifolds

نویسندگان

چکیده

We propose an extrinsic Bayesian optimization (eBO) framework for general problems on manifolds. algorithms build a surrogate of the objective function by employing Gaussian processes and utilizing uncertainty in that deriving acquisition function. This represents probability improvement based kernel process, which guides search process. The critical challenge designing manifolds lies difficulty constructing valid covariance kernels Our approach is to employ first embedding manifold onto some higher dimensional Euclidean space via equivariant embeddings then image after embedding. leads efficient scalable over complex Simulation study real data analyses are carried out demonstrate utilities our eBO applying various such as sphere, Grassmannian, positive definite matrices.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PARAMETRIC MANIFOLDS I: Extrinsic Approach

A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter family of hypersurfaces orthogonal to the curves, each of which inherits a metric and connection from the original manifold via orthogonal projections; this is th...

متن کامل

Invariant Bayesian Estimation on Manifolds

A frequent and well-founded criticism of the maximum a posteriori (MAP) and minimum mean squared error (MMSE) estimates of a continuous parameter γ taking values in a differentiable manifold Γ is that they are not invariant to arbitrary ‘reparametrizations’ of Γ. This paper clarifies the issues surrounding this problem, by pointing out the difference between coordinate invariance, which is a si...

متن کامل

On Bayesian Estimation in Manifolds

It is frequently stated that the maximum a posteriori (MAP) and minimum mean squared error (MMSE) estimates of a continuous parameter γ are not invariant to arbitrary “reparametrizations” of the parameter space Γ. This report clarifies the issues surrounding this problem, by pointing out the difference between coordinate invariance, which is a sine qua non for a mathematically well-defined prob...

متن کامل

Consensus Optimization on Manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e. max...

متن کامل

Localized LRR on Grassmann Manifolds: An Extrinsic View

Subspace data representation has recently become a common practice in many computer vision tasks. It demands generalizing classical machine learning algorithms for subspace data. Low-Rank Representation (LRR) is one of the most successful models for clustering vectorial data according to their subspace structures. This paper explores the possibility of extending LRR for subspace data on Grassma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2023

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a16020117